An Improved Chaos Sparrow Search Optimization Algorithm Using Adaptive Weight Modification and Hybrid Strategies
نویسندگان
چکیده
Sparrow Search Algorithm (SSA) is a kind of novel swarm intelligence algorithm, which has been applied in-to various domains because its unique characteristics, such as strong global search capability, few adjustable parameters, and clear structure. However, the SSA still some inherent weaknesses that hinder further development, poor population diversity, weak local searchability, falling into optimal easily. This manuscript proposes an improved chaos sparrow optimization algorithm (ICSSOA) to overcome mentioned shortcomings standard SSA. Firstly, Cubic mapping introduced increase diversity in initialization stage. Then, adaptive weight employed automatically adjust step for balancing performance capability different phases. Finally, hybrid strategy Levy flight reverse learning presented perturb position individuals according random strategy, greedy utilized select with higher fitness values decrease possibility optimum. The experiments are divided two modules. former investigates proposed approach through 20 benchmark functions using ICSSOA, SSA, other four variants. In latter experiment, selected also optimized by ICSSOA classic algorithms, namely ACO, PSO, GWO, WOA. Experimental results corresponding statistical analysis revealed only one function test was slightly lower than CSSOA WOA among 20-function optimization. most cases, both solution accuracy convergence speed algorithms. It indicates outstanding ability jump out
منابع مشابه
IIR System Identification Using Improved Harmony Search Algorithm with Chaos
Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...
متن کاملiir system identification using improved harmony search algorithm with chaos
due to the fact that the error surface of adaptive infinite impulse response (iir) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. in this case, global optimization techniques are required in order to avoid the local minima. harmony search (hs), a musical inspired metaheuristic, is a recently ...
متن کاملImproved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملAN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS
The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods...
متن کاملImproved parallel chaos optimization algorithm
Chaos optimization algorithm (COA), which has the features of easy implementation, short execution time and robust mechanisms of escaping from the local optimum, is a promising tool for the engineering applications. The design of approaches to improve the convergence of the COA is a challenging issue. Improved mutative-scale parallel chaotic optimization algorithm (MPCOA) are proposed in this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2022
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2022.3204798